package com.dkd.day20250616;

public class SolutionMoreThanHalfNum_Solution {
    public static void main(String[] args) {

    }
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param numbers int整型一维数组
     * @return int整型
     */
    public int MoreThanHalfNum_Solution (int[] numbers) {
        // write code here
        //寻找出现超过一版的数
        int result = numbers[0];
        int count = 1;
        for (int i = 1; i < numbers.length; i++) {
            if (count == 0) {
                result = numbers[i];
                count = 1;
            }else if (result == numbers[i]) {
                count++;
            }else{
                count--;
            }
        }
        count = 0;
        for (int i = 0; i < numbers.length; i++) {
            if (result == numbers[i]) count++;
        }
        return (count > numbers.length/2) ? result : 0;
    }
}
